Agile Prediction of Ongoing Temporal Sequences Based on Dominative Random Subsequences

نویسندگان

  • Ning Yang
  • Changjie Tang
چکیده

This paper identifies a new paradigm of prediction, Agile Prediction of ongoing temporal sequences, which achieves an acceptable accuracy just by the historical subsequences as short as possible and as close to the predicted time point as possible. To address agile prediction, a new concept, Dominative Random Subsequence (DRS for short), is first introduced to capture the local influence and local regularity of the subsequences that are decisive to the future of an ongoing temporal sequence. DRS mining algorithm, MDRS, and its optimal implementation OptMDRS, are also presented. In MDRS and OptMDRS, DRSs are organized as a suffix tree, DRS-Tree, to facilitate the retrieval. Next, this paper proposes an agile prediction algorithm, AgilePredict, to make accurate predictions based the DRS that is closest to the predicted time point. Finally, the results of the extensive experiments conducted on synthetic and real data sets show that our proposed method is feasible and efficient for agile prediction.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Mining Biological Repetitive Sequences Using Support Vector Machines and Fuzzy SVM

Structural repetitive subsequences are most important portion of biological sequences, which play crucial roles on corresponding sequence’s fold and functionality. Biggest class of the repetitive subsequences is “Transposable Elements” which has its own sub-classes upon contexts’ structures. Many researches have been performed to criticality determine the structure and function of repetitiv...

متن کامل

Finding Exact and Solo LTR-Retrotransposons in Biological Sequences Using SVM

Finding repetitive subsequences in genome is a challengeable problem in bioinformatics research area. A lot of approaches have been proposed to solve the problem, which could be divided to library base and de novo methods. The library base methods use predetermined repetitive genome’s subsequences, where library-less methods attempt to discover repetitive subsequences by analytical approach...

متن کامل

DNA sequences useful for computation

Recent proposals for DNA based computing 1], 2], 3] encode Boolean vector component values with sequences of DNA. It has previously been assumed that suucient length random subsequences could be used to encode component values. However use of such subsequences will inadvertently result in long complementary subsequences. Complementary subsequences of suucient length would stick to each other an...

متن کامل

نقش حروف ربط زمان دار در تعیین رابطۀ زمانی بین رویدادهای فعلی در پیکرۀ متون زبان فارسی معاصر

This paper involves in prediction of temporal relation between tensed-verb events on the basis of conjunctions in texts. For this purpose, tensed verb event data were extracted from Contemporary Persian Corpus and were examined carefully. The temporal relations between events were identified. After analyzing data on the basis of temporal relation according to Bird’s and Allen’s categorization, ...

متن کامل

The Non-scan Delay Test Enrichment Based on Random Generated Long Test Sequences

The paper investigates the possibilities of application of random generated test sequences for at-speed testing of non-scan synchronous sequential circuits. Our research shows that relatively long random test sequences exhibit better transition fault coverages than tests produced by deterministic ATPG tools. We proposed an approach for dividing of long test sequences into subsequences. The appl...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Int. J. Computational Intelligence Systems

دوره 6  شماره 

صفحات  -

تاریخ انتشار 2013